package leetcode;

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

//2019蓝桥杯迷宫
public class Migong {
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
         int[][] arr = new int[30][50];
        List<String> list=new ArrayList<>();
        for (int i = 0; i < arr.length; i++) {
            for (int j = 0; j < arr[i].length; j++) {
                arr[i][j]=sc.nextInt();
            }
        }
        char[]a={'D','L','U','R'};

    }
    public static void bfs(int[][]arr,int x,int y,List list){



    }
}
